Automatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition

In this paper we present a recursive volume decomposition method for automatically decomposing complex shaped objects with both protrusions and depressions into simpler sub-objects for automatic hexahedral mesh generation. The sub-volumes after decomposition are classified into either convex or swept volumes. For a convex volume, it is mapped to a collection of hexahedral objects. On the other hand, for a swept volume, a hexahedral mesh can be created by generating a quadrilateral mesh on the sweeping face and then sweeping this quadrilateral mesh onto the swept volume. Moreover, in order to apply the current mesh generation approach to more general geometry we use the topological and geometric requirements to determine the generalized swept volumes. To separate volumes into sub-volumes, a recursive algorithm of volume decomposition is used until all the volumes are either convex or swept objects.